The twenty-fourth Fermat number is composite
نویسندگان
چکیده
We have shown by machine proof that F24 = 22 24+1 is composite. The rigorous Pépin primality test was performed using independently developed programs running simultaneously on two different, physically separated processors. Each program employed a floating-point, FFT-based discrete weighted transform (DWT) to effect multiplication modulo F24. The final, respective Pépin residues obtained by these two machines were in complete agreement. Using intermediate residues stored periodically during one of the floating-point runs, a separate algorithm for pure-integer negacyclic convolution verified the result in a “wavefront” paradigm, by running simultaneously on numerous additional machines, to effect piecewise verification of a saturating set of deterministic links for the Pépin chain. We deposited a final Pépin residue for possible use by future investigators in the event that a proper factor of F24 should be discovered; herein we report the more compact, traditional Selfridge-Hurwitz residues. For the sake of completeness, we also generated a Pépin residue for F23, and via the Suyama test determined that the known cofactor of this number is composite. 1 Computational history of Fermat numbers It is well known that P. Fermat, in the early part of the 17th century, described the numbers
منابع مشابه
The Twenty-second Fermat Number Is Composite
We have shown by machine proof that F22 = 22 +1 is composite. In addition, we reenacted Young and Buell's 1988 resolution of F20 as composite, finding agreement with their final Selfridge-Hurwitz residues. We also resolved the character of all extant cofactors of Fn , n < 22, finding no new primes, and ruling out prime powers.
متن کاملA Curious Connection between Fermat Numbers and Finite Groups
1. INTRODUCTION. In the seventeenth century, Fermat defined the sequence of numbers F n = 2 2 n + 1 for n ≥ 0, now known as Fermat numbers. If F n happens to be prime, F n is called a Fermat prime. Fermat showed that F n is prime for each n ≤ 4, and he conjectured that F n is prime for all n (see Brown [1] or Burton [2, p. 271]). Almost one hundred years passed before Euler demonstrated in 1732...
متن کاملOn the Fermat Periods of Natural Numbers
Let b > 1 be a natural number and n ∈ N0. Then the numbers Fb,n := b 2 +1 form the sequence of generalized Fermat numbers in base b. It is well-known that for any natural number N , the congruential sequence (Fb,n (mod N)) is ultimately periodic. We give criteria to determine the length of this Fermat period and show that for any natural number L and any b > 1 the number of primes having a peri...
متن کاملImproved Error Bounds for the Fermat Primality Test on Random Inputs
We investigate the probability that a random odd composite number passes a random Fermat primality test, improving on earlier estimates in moderate ranges. For example, with random numbers to 2200, our results improve on prior estimates by close to 3 orders of magnitude.
متن کاملCarmichael Numbers in Number Rings
for all integers a. This result gives us the rudimentary Fermat Compositeness Test: If a 6≡ a (mod n) for some integer a, then n is composite. While this has the advantage of being computationally simple, it has the distinct disadvantage of failing for some composite n and choice of a. Take, for example, n = 341 = 31 · 11 and a = 2. A quick computation tells us that 2 ≡ 2 (mod 341). Fortunately...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 72 شماره
صفحات -
تاریخ انتشار 2003